Coverage-Based Semi-distance between Horn Clauses

نویسندگان

  • Zdravko Markov
  • Ivo Marinchev
چکیده

In the present paper we use the approach of height functions to de ning a semi distance measure between Horn clauses This appraoch is already discussed elsewhere in the framework of propositional and sim ple rst order languages atoms Hereafter we prove its applicability for Horn clauses We use some basic results from lattice theory and introduce a family of language independent coverage based height functions Then we show how these results apply to Horn clauses We also show an exam ple of conceptual clustering of rst order atoms where the hypotheses are Horn clauses

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coverage - based semi - distance between

In the present paper we use the approach of height functions to deening a semi-distance measure between Horn clauses. This appraoch is already discussed elsewhere in the framework of propositional and simple rst order languages (atoms). Hereafter we prove its applicability for Horn clauses. We use some basic results from lattice theory and introduce a family of language independent coverage-bas...

متن کامل

Distance Induction in First Order Logic

This paper tackles the supervised induction of a distance from examples described as Horn clauses or constrained clauses. In opposition to syntax-driven approaches, this approach is discrimination-driven: it proceeds by deening a small set of complex discriminant hypotheses. These hypotheses serve as new concepts, used to redescribe the initial examples. Further, this redescription can be embed...

متن کامل

A Semi-automatic Method to Ontology Design by Using FCA

Ontology design is a complex and time-consuming process. It is extremely difficult for human experts to discover ontology from given data or texts. This paper presents a semi-automatic method for ontology extraction and design. The method is based on Formal Concept Analysis and a Horn clause model of a concept lattice. Inputs to the technique are domain-specific texts or data. After transformat...

متن کامل

Normalization of Horn clauses with disequality constraints

Horn clauses constitute a convenient, Turing-powerful tool for the specification and representation of analysis problems. However, it is not possible to express disequality conditions directly and in a natural way by means of Horn clauses. This thesis therefore proposes an extension of Horn clauses with several kinds of disequality constraints. In order to provide an automatic analysis framewor...

متن کامل

The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics

This paper presents complexity results about the satisfiability ofmodal Horn clauses for several modal propositional logics. Almost all these results are negative in the sense that restricting the input formula to modal Horn clauses does not decrease the inherent complexity of the satisfiability problem. We first show that, when restricted to modal Horn clauses, the satisfiability problem for a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000